#define  _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include"SearchBinaryTree.h"
using namespace std;

int main()
{
	key::BSTree<int> t;
	int a[] = {5,4,6,3,2,1,9,8};
	for (auto e : a)
	{
		t.Insert(e);
	}
	bool ret = t.Find(2);
	t.InOrder();
	cout << ret << endl;
	t.Erase(9);
	t.InOrder();
	return 0;
}